Näytetään tulokset 1 - 10 / 3636
tulosta / sivu
Mitä julkaisutietoja palvelu sisältää?
Julkaisun nimi
Tekijät
Julkaisukanava
Vuosi

Computational Complexity of the Place/Transition-Net Symmetry Reduction Method

Vertaisarvioitu
Junttila, Tommi A.
Journal of Universal Computer Science2001

On Computational Complexity Reduction Methods for Kalman Filter Extensions

Vertaisarvioitu
Avoin saatavuus
DOI
10.1109/MAES.2019.2927898
Raitoharju, Matti; Piché, Robert
IEEE aerospace and electronic systems magazine2019

Tiling problem and undecidability in cellular automata

Vertaisarvioitu
Jarkko Kari
Computational complexity2012

On the usefulness of predicates

Vertaisarvioitu
DOI
10.1109/CCC.2012.18
Austrin, Per; Håstad, Johan
IEEE Conference on Computational Complexity2012

Low-Computational-Complexity Zeroing Neural Network Model for Solving Systems of Dynamic Nonlinear Equations

Vertaisarvioitu
Avoin saatavuus
DOI
10.1109/tac.2023.3319132
Zheng, Kangze; Li, Shuai; Zhang, Yunong
IEEE transactions on automatic control2024

Physical portrayal of computational complexity

Vertaisarvioitu
DOI
10.5402/2012/321372
Annila, Arto
-2012

On the Decidability and Complexity of Autoepistemic Reasoning

Vertaisarvioitu
Niemelä, I.
Fundamenta Informaticae1992

Computational complexity of queries based on itemsets

Vertaisarvioitu
Tatti, Nikolaj
Information Processing Letters2006

Computational and proof complexity of partial string avoidability

Vertaisarvioitu
Avoin saatavuus
DOI
10.4230/LIPIcs.MFCS.2016.51
Dimitry Itsykson, Alexander Okhotin, Vsevolod Oparin
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)2016

On Computational Complexity of Graph Inference from Counting

Vertaisarvioitu
DOI
10.1007/s11047-012-9349-2
Fazekas, S.Z.; Ito, H.; Okuno, Y.; Seki, S.; Taneishi, K.
Natural computing2013

Computational Complexity of the Place/Transition-Net Symmetry Reduction Method

Vertaisarvioitu
2001

On Computational Complexity Reduction Methods for Kalman Filter Extensions

Vertaisarvioitu
Avoin saatavuus
DOI
10.1109/MAES.2019.2927898
2019

Tiling problem and undecidability in cellular automata

Vertaisarvioitu
2012

On the usefulness of predicates

Vertaisarvioitu
DOI
10.1109/CCC.2012.18
2012

Low-Computational-Complexity Zeroing Neural Network Model for Solving Systems of Dynamic Nonlinear Equations

Vertaisarvioitu
Avoin saatavuus
DOI
10.1109/tac.2023.3319132
2024

Physical portrayal of computational complexity

Vertaisarvioitu
DOI
10.5402/2012/321372
2012

On the Decidability and Complexity of Autoepistemic Reasoning

Vertaisarvioitu
1992

Computational complexity of queries based on itemsets

Vertaisarvioitu
2006

Computational and proof complexity of partial string avoidability

Vertaisarvioitu
Avoin saatavuus
DOI
10.4230/LIPIcs.MFCS.2016.51
2016

On Computational Complexity of Graph Inference from Counting

Vertaisarvioitu
DOI
10.1007/s11047-012-9349-2
2013